Decomposition of Grey-Scale Morphological Structuring Elements in Hardware
نویسنده
چکیده
AbstractMorphological image processing machines are not capable of handling large-size structuring elements. A new architecture for fast execution of the erosion/dilation operations in an up to 9× 9-pixel, arbitrarily shaped, image window through decomposition of grey-scale morphological structuring element into 3× 3-pixel sub-domains is presented in this paper. The proposed hardware structure has been also implemented in VLSI and its throughput rate is 10 Mbytes/sec.
منابع مشابه
Soft Morphological Structuring Element Decomposition
In this paper a decomposition technique suitable for any grey-scale soft morphological structuring element is presented. A hardware structure implementing this technique is also presented.
متن کاملGray-Scale Structuring Element Decomposition - Image Processing, IEEE Transactions on
AbstructEfficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. In this paper, we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find a...
متن کاملAn ASIC for fast grey-scale dilation
The design and VLSI implementation of a new ASIC which performs the operation of grey-scale dilation using both image and structuring element threshold decomposition is presented in this paper. The minimum rate of external operations of this ASIC is 30 MPix/sec and it can handle 3 x 3 pixel images and structuring elements of up to 4-bit resolution. The high speed of operation is achieved using ...
متن کاملCamps , Kanungo and Haralick : Grayscale Sturcturing Element Decomposition
| EEcient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to nd optimal decompositions of structuring elements in binary morphology. In this paper we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to nd an optimal dec...
متن کاملGray-scale structuring element decomposition
Efficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick (1986) presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. We use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find an optimal decomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001